Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls
نویسندگان
چکیده
منابع مشابه
An Insertion Heuristic for the Capacitated Vehicle Routing Problem with Loading Constraints and Mixed Linehauls and Backhauls
In this paper, a capacitated vehicle routing problem with mixed linehauls and backhauls is presented. The addressed problem belongs to the subclass of pickup and delivery problems. Loading and sequencing constraints are also considered. These constraints arise in many realworld situations, and can improve efficiency since backhaul customers do not need to be delayed in a route when it is possib...
متن کاملErratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
The article addresses the well-known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two-dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the customers, and carried out by a fleet of vehicles based at a central depot. In ...
متن کاملA Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints
We present a metaheuristic methodology for the Capacitated Vehicle Routing Problem with two-dimensional loading constraints (2LCVRP). 2L-CVRP is a generalisation of the Capacitated Vehicle Routing Problem, in which customer demand is formed by a set of twodimensional, rectangular, weighted items. The purpose of this problem is to produce the minimum cost routes, starting and terminating at a ce...
متن کاملMetaheuristics for the Vehicle Routing Problem with Clustered Backhauls and 3D Loading Constraints
In this paper, we extend the vehicle routing problem with clustered backhauls (VRPCB) to an integrated routing and three-dimensional loading problem, called VRPCB with 3D loading constraints (3L-VRPCB). In the VRPCB each customer is either a linehaul or a backhaul customer and in each route all linehaul customers must be visited before any backhaul customer. In the 3L-VRPCB, each customer deman...
متن کاملModified Variable Neighborhood Search for the Vehicle Routing Problem with Accessibility Constraints
The classical capacitated Vehicle Routing Problem (VRP) consists in determining optimal delivery routes for a set of homogeneous vehicles to serve a set of customers. Each route is covered by one vehicle without exceeding its capacity. Moreover, each route starts and ends at the same depot. Each customer is served exactly once. In this paper, we consider the Vehicle Routing Problem with Accessi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2018
ISSN: 0969-6016
DOI: 10.1111/itor.12509